On the Decidability of the Existential Theory of Fp[[t]]

Decidability and Tameness in the Theory of Finite Semigroups

Decidability and Complexity of Tree Share Formulas

Fractional share models are used to reason about how multiple actors share ownership of resources. We examine the decidability and complexity of reasoning over the “tree share” model of Dockins et al. using first-order logic, or fragments thereof. We pinpoint a connection between the basic operations on trees union t, intersection u, and complement and countable atomless Boolean algebras, allow...

Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic

The system FT of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate decidability and complexity questions for fragments of the first-order theory of FT . It is well-known that the first-order theory of FT is decidable and that several of its fragments can be decided in quasi-linear time, includi...

The Existential Theory of the Poset of R . E . Degrees

We show the decidability of the existential theory of the recursively enumerable degrees in the language of Turing reducibility, Turing reducibility of the Turing jumps, and least and greatest element. The Existential Theory of the Poset of R.E. Degrees with a Predicate for Single Jump Reducibility

Effectiveness of ontological security training on psychological safety and existential anxiety of elder people

Introduction: Old ages are one of the most major period of human life which because of its nature and being close to death time enhances deep questions about existential identity of man, anxiety related to effacement and annihilation, meaningfulness, feelings of unsafety, loneliness and seclusion in mind of most elder people. So this research has been done to review the effectiveness of ontolog...